Chromatic Derivatives, Chromatic Expansions and Associated Spaces

نویسنده

  • ALEKSANDAR IGNJATOVIĆ
چکیده

This paper presents the basic properties of chromatic derivatives and chromatic expansions and provides an appropriate motivation for introducing these notions. Chromatic derivatives are special, numerically robust linear differential operators which correspond to certain families of orthogonal polynomials. Chromatic expansions are series of the corresponding special functions, which possess the best features of both the Taylor and the Shannon expansions. This makes chromatic derivatives and chromatic expansions applicable in fields involving empirically sampled data, such as digital signal and image processing. 1. Extended Abstract Let BL(π) be the space of continuous L functions with the Fourier transform supported within [−π, π] (i.e., the space of π band limited signals of finite energy), and let P n (ω) be obtained by normalizing and scaling the Legendre polynomials, so that 1 2π ∫ π −π P n (ω) P L m(ω)dω = δ(m− n). We consider linear differential operators Kn = (−i)P n ( i d dt ) ; for such operators and every f ∈ BL(π), K[f ](t) = 1 2π ∫ π −π i P n (ω)f̂(ω)e idω. We show that for f ∈ BL(π) the values of Kn[f ](t) can be obtained in a numerically accurate and noise robust way from samples of f(t), even for differential operators Kn of high order. Operators Kn have the following remarkable properties, relevant for applications in digital signal processing. Proposition 1.1. Let f : R → R be a restriction of any entire function; then the following are equivalent: (a) ∑∞ n=0 Kn[f ](0) < ∞; (b) for all t ∈ R the sum ∑∞ n=0 Kn[f ](t) converges, and its values are independent of t ∈ R; (c) f ∈ BL(π). 2000 Mathematics Subject Classification. 41A58, 42C15, 94A12, 94A20.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Chromatic derivatives and non-separable inner product spaces

We present a detailed motivation for the notions of the chromatic derivatives and the chromatic expansions. The chromatic derivatives are special, numerically robust linear differential operators. The chromatic expansions are the associated local expansions, which possess features of both the Taylor and the Nyquist expansions. We give simplified treatment of some of the basic properties of the ...

متن کامل

Multidimensional Chromatic Derivatives and Series Expansions

Chromatic derivatives and series expansions of bandlimited functions have recently been introduced as an alternative representation to Taylor series and they have been shown to be more useful in practical signal processing applications than Taylor series. Although chromatic series were originally introduced for bandlimited functions, they have now been extended to a larger class of functions. T...

متن کامل

Expansions of Chromatic Polynomials and Log-concavity

In this paper we present several results and open problems about logconcavity properties of sequences associated with graph colorings. Five polynomials intimately related to the chromatic polynomial of a graph are introduced and their zeros, combinatorial and log-concavity properties are studied. Four of these polynomials have never been considered before in the literature and some yield new ex...

متن کامل

Chromatic Harmonic Indices and Chromatic Harmonic Polynomials of Certain Graphs

In the main this paper introduces the concept of chromatic harmonic polynomials denoted, $H^chi(G,x)$ and chromatic harmonic indices denoted, $H^chi(G)$ of a graph $G$. The new concept is then applied to finding explicit formula for the minimum (maximum) chromatic harmonic polynomials and the minimum (maximum) chromatic harmonic index of certain graphs. It is also applied to split graphs and ce...

متن کامل

The locating-chromatic number for Halin graphs

Let G be a connected graph. Let f be a proper k -coloring of G and Π = (R_1, R_2, . . . , R_k) bean ordered partition of V (G) into color classes. For any vertex v of G, define the color code c_Π(v) of v with respect to Π to be a k -tuple (d(v, R_1), d(v, R_2), . . . , d(v, R_k)), where d(v, R_i) is the min{d(v, x)|x ∈ R_i}. If distinct vertices have distinct color codes, then we call f a locat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009